Short QMA(k) Proofs for SAT without Entangling Measurements
نویسندگان
چکیده
BellQMA(k) is the subclass of QMA(k) in which the verifier is restricted to perform unentangling measurements on the proofs received from each Merlin. BellQMAO(log m)(Õ( √ m)) is the class of promise problems having BellQMA proofs with Õ( √ m) provers, each sending an O(logm)-qubit message, and with a constant completeness-soundness gap. In this paper, we prove that a 3SAT instance with m clauses has a BellQMAO(log m)(Õ( √ m)) proof of satisfiability. Our result improves the result of Aaronson, Beigi, Drucker, Fefferman, and Shor in [ABDFS’08], who showed that 3SAT has a QMAO(log m)(Õ( √ m)) proof with a constant completeness-soundness gap.
منابع مشابه
The Complexity of the Local Hamiltonian Problem
The k-LOCAL HAMILTONIAN problem is a natural complete problem for the complexity class QMA, the quantum analog of NP. It is similar in spirit to MAX-k-SAT, which is NPcomplete for k ≥ 2. It was known that the problem is QMA-complete for any k ≥ 3. On the other hand 1-LOCAL HAMILTONIAN is in P, and hence not believed to be QMA-complete. The complexity of the 2-LOCAL HAMILTONIAN problem has long ...
متن کاملOn QMA protocols with two short quantum proofs
The quantum complexity class QMA [9, 10, 16] is a quantum analogue of the complexity class NP (or of the class MA). That is, a decision problem is in QMA if there is a polynomial-time quantum algorithm V (called the verifier) that satisfies the following two properties: (completeness) V accepts any yes-instance with probability ≥ a by the help of a quantum state (called a quantum proof); (sound...
متن کاملThe Power of Unentanglement ( Extended
The class QMA (k), introduced by Kobayashi et al., consists of all languages that can be verified using k unentangled quantum proofs. Many of the simplest questions about this class have remained embarrassingly open: for example, can we give any evidence that k quantum proofs are more powerful than one? Can we show any upper bound on QMA (k), besides the trivial NEXP? Does QMA (k) = QMA (2) for...
متن کاملEfficient algorithm for a quantum analogue of 2-SAT
Complexity of a quantum analogue of the satisfiability problem is studied. Quantum k-SAT is a problem of verifying whether there exists a state |Ψ〉 of n qubits such that its k-qubit reduced density matrices have support on prescribed subspaces. We present a classical algorithm solving quantum 2-SAT in a polynomial time. It generalizes the well-known algorithm for the classical 2-SAT. Besides, w...
متن کاملQuantum proofs can be verified using only single qubit measurements
QMA (Quantum Merlin Arthur) is the class of problems which, though potentially hard to solve, have a quantum solution which can be verified efficiently using a quantum computer. It thus forms a natural quantum version of the classical complexity class NP (and its probabilistic variant MA, Merlin-Arthur games), where the verifier has only classical computational resources. In this paper, we stud...
متن کامل